Effects of Transparent Performance Data on Employee Performance: Evidence from a Field Experiment

There is a growing trend of continuously tracking performance metrics and providing them to employees via digital means without supervisor intermediation. Using a field experiment at a service organization, we examine how employees respond to transparent performance data previously available only to supervisors (i.e., daily performance metrics of employees in the same work group). We find that, compared with the pre-intervention mean value, the treatment group experienced an 11-percent decrease in strictly nonproductive time relative to the control group. The effect on reducing strictly nonproductive time seems greater than that on increasing strictly productive time. Performance improvements are greater in certain employee subsamples: those who previously perceived their supervisors as less-supportive, those with low intrinsic motivation, and those with high extrinsic motivation. We find inconclusive evidence on the moderating effects of social comparison orientation, suggesting that the main effect is unlikely to be driven by access to relative performance information

Strengths and Weaknesses of Quantum Computing

Recently a great deal of attention has focused on quantum computation following a sequence of results suggesting that quantum computers are more powerful than classical probabilistic computers. Following Shor's result that factoring and the extraction of discrete logarithms are both solvable in quantum polynomial time, it is natural to ask whether all of NP can be efficiently solved in quantum polynomial time. In this paper, we address this question by proving that relative to an oracle chosen uniformly at random, with probability 1, the class NP cannot be solved on a quantum Turing machine in time $o(2^{n/2})$. We also show that relative to a permutation oracle chosen uniformly at random, with probability 1, the class $NP \cap coNP$ cannot be solved on a quantum Turing machine in time $o(2^{n/3})$. The former bound is tight since recent work of Grover shows how to accept the class NP relative to any oracle on a quantum computer in time $O(2^{n/2})$.Comment: 18 pages, latex, no figures, to appear in SIAM Journal on Computing (special issue on quantum computing

Facts and Figuring: An Experimental Investigation of Network Structure and Performance in Information and Solution Spaces

Using data from a novel laboratory experiment on complex problem solving in which we varied the network structure of 16-person organizations, we investigate how an organization’s network structure shapes performance in problem-solving tasks. Problem solving, we argue, involves both search for information and search for solutions. Our results show that the effect of network clustering is opposite for these two important and complementary forms of search. Dense clustering encourages members of a network to generate more diverse information, but discourages them from generating diverse theories: in the language of March (1991), clustering promotes exploration in information space, but decreases exploration in solution space. Previous research, generally focusing on only one of those two spaces at a time, has produced an inconsistent understanding of the value of network clustering. By adopting an experimental platform on which information was measured separately from solutions, we were able to bring disparate results under a single theoretical roof and clarify the effects of network clustering on problem-solving behavior and performance. The finding both provides a sharper tool for structuring organizations for knowledge work and reveals the challenges inherent in manipulating network structure to enhance performance, as the communication structure that helps one antecedent of successful problem solving may harm the other

The Consumer Financial Protection Bureau: Financial Regulation for the 21st Century

After existing regulatory systems failed to prevent the recent financial crisis, Congress passed the Dodd-Frank Wall Street Reform and Consumer Protection Act, a sweeping reform designed to alleviate the crisis and prevent its recurrence. Out of this Act, the Consumer Financial Protection Bureau was born. This new agency is charged with making markets for consumer financial products and services work for Americans, a task that was previously spread out among seven different federal agencies with varying priorities. This Article describes, with a series of concrete case studies, four key principles that have guided the Bureau as it strives to fulfill Congress\u27s mandate. First, the Bureau has taken a market-based approach that reflects its belief in the power of markets and competition to produce increasingly better outcomes for consumers and responsible providers alike. Second, recognizing that understanding a market well is essential to effective regulation, the Bureau has relied on evidence-based analysis to inform all of its activities. Third, the Bureau has complemented its empirical analysis with input from all segments of the public-including consumers, advocates, and regulated entities. To facilitate the kind of robust public participation that will make for more effective regulation, the Bureau has employed innovative technologies and strong transparency policies. Finally, the Bureau has studied and learned from historic regulatory experiences and has adopted best practices from the public and private sectors. These four principles, and others which cascade from them, define the Bureau\u27s twenty-first century approach to promoting a well-functioning market for consumer financial services and effective consumer protection

Problem Solving and Search in Networks

Abstract This chapter examines the role that networks play in facilitating or inhibiting search for solutions to problems at both the individual and collective levels. At the individual level, search in networks enables individuals to transport themselves to a very different location in the solution space than they could likely reach through isolated experimental or cognitive search. Research on networks suggests that (a) ties to diverse others provide a wider menu of choices and insights for individuals, and (b) strong ties will be relatively more useful for complex information, and weak ties for simple information. At the collective level, these conclusions become less clear. The key question is how the collective operates to coordinate within the group versus beyond it so as to balance experimentation and convergence towards a solution. Collective coordination of search, and collective evaluation of potential solutions, may significantly influence the optimal network structure for collective problem-solving search

How intermittent breaks in interaction improve collective intelligence

People influence each other when they interact to solve problems. Such social influence introduces both benefits (higher average solution quality due to exploitation of existing answers through social learning) and costs (lower maximum solution quality due to a reduction in individual exploration for novel answers) relative to independent problem solving. In contrast to prior work, which has focused on how the presence and network structure of social influence affect performance, here we investigate the effects of time. We show that when social influence is intermittent it provides the benefits of constant social influence without the costs. Human subjects solved the canonical traveling salesperson problem in groups of three, randomized into treatments with constant social influence, intermittent social influence, or no social influence. Groups in the intermittent social-influence treatment found the optimum solution frequently (like groups without influence) but had a high mean performance (like groups with constant influence); they learned from each other, while maintaining a high level of exploration. Solutions improved most on rounds with social influence after a period of separation. We also show that storing subjects' best solutions so that they could be reloaded and possibly modified in subsequent rounds-a ubiquitous feature of personal productivity software-is similar to constant social influence: It increases mean performance but decreases exploration.https://www.pnas.org/content/pnas/115/35/8734.full.pdfPublished versio

Global nucleosome occupancy in yeast

BACKGROUND: Although eukaryotic genomes are generally thought to be entirely chromatin-associated, the activated PHO5 promoter in yeast is largely devoid of nucleosomes. We systematically evaluated nucleosome occupancy in yeast promoters by immunoprecipitating nucleosomal DNA and quantifying enrichment by microarrays. RESULTS: Nucleosome depletion is observed in promoters that regulate active genes and/or contain multiple evolutionarily conserved motifs that recruit transcription factors. The Rap1 consensus was the only binding motif identified in a completely unbiased search of nucleosome-depleted promoters. Nucleosome depletion in the vicinity of Rap1 consensus sites in ribosomal protein gene promoters was also observed by real-time PCR and micrococcal nuclease digestion. Nucleosome occupancy in these regions was increased by the small molecule rapamycin or, in the case of the RPS11B promoter, by removing the Rap1 consensus sites. CONCLUSIONS: The presence of transcription factor-binding motifs is an important determinant of nucleosome depletion. Most motifs are associated with marked depletion only when they appear in combination, consistent with a model in which transcription factors act collaboratively to exclude nucleosomes and gain access to target sites in the DNA. In contrast, Rap1-binding sites cause marked depletion under steady-state conditions. We speculate that nucleosome depletion enables Rap1 to define chromatin domains and alter them in response to environmental cues